ε-Capacities and Second-Order Coding Rates for Channels with General State
نویسندگان
چکیده
We consider state-dependent channels with general state available at both the encoder and the decoder. We establish the "-capacity and the optimistic "-capacity of such channels. The determination of these capacities allows us to provide a necessary and sufficient condition for the strong converse property to hold. We also provide a simpler sufficient condition on the firstand second-order statistics of the state process that ensures that the strong converse property holds. We then seek a finer characterization of these capacities in terms of second-order coding rates. The general results are supplemented by several examples including i.i.d. and Markov states and mixed channels. The proofs of the specializations of the general second-order result to the specific examples require new techniques such as multiple applications of various forms of the Berry-Esseen theorems.
منابع مشابه
Second-order coding rates for pure-loss bosonic channels
A pure-loss bosonic channel is a simple model for communication over free-space or fiberoptic links. More generally, phase-insensitive bosonic channels model other kinds of noise, such as thermalizing or amplifying processes. Recent work has established the classical capacity of all of these channels, and furthermore, it is now known that a strong converse theorem holds for the classical capaci...
متن کاملFixed Error Asymptotics For Erasure and List Decoding
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show that second-order capacity is √ V Φ−1( t) where V is the channel dispersion and t is the total error probability, i.e., the sum of the erasure and undetected errors. We show numerically that the expected rate at finite b...
متن کاملCapacity of Interactive Communication over Erasure Channels and Channels with Feedback
We consider interactive communication performed over two simple types of noisy channels: binary error channels with noiseless feedback and binary erasure channels. In both cases, the noise model is adversarial. Assuming at most εfraction of the bits can be corrupted, we show coding schemes that simulate any alternating interactive protocol with rate 1 − Θ(H(ε)). All our simulations are simple, ...
متن کاملThe Sphere Packing Bound via Augustin's Method
The channel coding problem is reviewed for an abstract framework. If the scaled Renyi capacities of a sequence of channels converge to a finite continuous function φ on an interval of the form (1− ε, 1] for an ε > 0, then the capacity of the sequence of channels is φ(1). If the convergence holds on an interval of the form (1 − ε, 1 + ε) then the strong converse holds. Both hypotheses hold for l...
متن کاملA coding theorem for secret sharing communication systems with two Gaussian wiretap channels
A coding theorem is proved for the secret sharing communication system (SSCS) with two Gaussian wiretap channels. This communication system is an extension of both the SSCS with two noiseless channels and the Gaussian wiretap channel (GWC). The admissible region of rates and security levels for the SSCS with two GWC’s is described by the capacities and secrecy capacities of two GWC’s.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1305.6789 شماره
صفحات -
تاریخ انتشار 2013